Optimal Deadlock-free Routing and Broadcasting on Fibonacci Cube Networks

Hsu recently proposed a new interconnection topology called Fibonacci cubes. ln this correspondence rve show that his routing and broadcasting algori thms do not work correctly and that a routing algorithm by Liu and Hsu does not run in optimal compu_ tation time. we also describe simple optimar deadlock-free routir,s and broadcasting algorithms. The routing algorithm sends ̂ -"rI sa.ge from a source to a destination along the shortest possible path and with asymptotically optimal comrnunication and computation times. The broadcasting procedure sends a nressage from source to all other nodes in optimal number of steps, equal to the diameter of the network, and uses one-port communication model.